Maximum flow problem

Results: 146



#Item
31Noname manuscript No. (will be inserted by the editor) Network Construction with Subgraph Connectivity Constraints Dana Angluin · James Aspnes · Lev

Noname manuscript No. (will be inserted by the editor) Network Construction with Subgraph Connectivity Constraints Dana Angluin · James Aspnes · Lev

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2015-04-30 10:34:00
32Testable Implications of Linear Structural Equation Models

Testable Implications of Linear Structural Equation Models

Add to Reading List

Source URL: ftp.cs.ucla.edu

Language: English - Date: 2014-05-09 18:54:50
33Algorithms  Lecture 24: Applications of Maximum Flow [Fa’13] For a long time it puzzled me how something so expensive, so leading edge, could be so useless, and then it occurred to me that a computer is a stupid

Algorithms Lecture 24: Applications of Maximum Flow [Fa’13] For a long time it puzzled me how something so expensive, so leading edge, could be so useless, and then it occurred to me that a computer is a stupid

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:03:09
34Finding Shortest Non-Trivial Cycles ∗ in Directed Graphs on Surfaces Sergio Cabello  Éric Colin de Verdière

Finding Shortest Non-Trivial Cycles ∗ in Directed Graphs on Surfaces Sergio Cabello Éric Colin de Verdière

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2010-04-01 04:31:48
35Capacity of Multi-Channel Wireless Networks ∗ with Random (c, f) Assignment Vartika Bhandari  Nitin H. Vaidya

Capacity of Multi-Channel Wireless Networks ∗ with Random (c, f) Assignment Vartika Bhandari Nitin H. Vaidya

Add to Reading List

Source URL: www.sigmobile.org

Language: English - Date: 2013-08-14 12:38:30
36Optimization  Algorithms Lecture 23: Maximum Flows and Minimum Cuts [Fa’13]

Optimization Algorithms Lecture 23: Maximum Flows and Minimum Cuts [Fa’13]

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 08:41:28
37MINIMUM REJECTION SCHEDULING IN ALL-PHOTONIC NETWORKS Nahid Saberi and Mark J. Coates Department of Electrical and Computer Engineering McGill University Montreal, QC, Canada E-mail: , coates@e

MINIMUM REJECTION SCHEDULING IN ALL-PHOTONIC NETWORKS Nahid Saberi and Mark J. Coates Department of Electrical and Computer Engineering McGill University Montreal, QC, Canada E-mail: , coates@e

Add to Reading List

Source URL: www.tsp.ece.mcgill.ca

Language: English - Date: 2006-07-13 16:30:06
38Proceedings of IEEE conference on “Computer Vision and Pattern Recognition” (CVPR), 1998  p.648 Markov Random Fields with Efficient Approximations Yuri Boykov

Proceedings of IEEE conference on “Computer Vision and Pattern Recognition” (CVPR), 1998 p.648 Markov Random Fields with Efficient Approximations Yuri Boykov

Add to Reading List

Source URL: www.cs.iastate.edu

Language: English - Date: 2004-09-12 22:08:02
39The Range Constraint: Algorithms and Implementation Christian Bessiere1 , Emmanuel Hebrard2 , Brahim Hnich3 , Zeynep Kiziltan4 , and Toby Walsh2 1

The Range Constraint: Algorithms and Implementation Christian Bessiere1 , Emmanuel Hebrard2 , Brahim Hnich3 , Zeynep Kiziltan4 , and Toby Walsh2 1

Add to Reading List

Source URL: homepages.laas.fr

Language: English - Date: 2010-11-22 06:22:31
40ICS 260 – Fall 2001 – First Midterm  Name: Student ID:  1:

ICS 260 – Fall 2001 – First Midterm Name: Student ID: 1:

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2001-10-18 19:06:29